منابع مشابه
On Randomly 3-axial Graphs
A graph G , every vertex of which has degree at least three, is randomly 3-axial if for each vertex V of G , any ordered collection of three paths in G of length one with initial vertex V can be cyclically randomly extended to produce three internally disjoint paths which contain all the vertices of G . Randomly 3-axial graphs of order p > k are characterized for p ^ 1 (mod 3) , and are shown t...
متن کاملOn randomly k-dimensional graphs
For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W ) := (d(v,w1), d(v,w2), . . . , d(v,wk)) is called the (metric) representation of v with respect to W , where d(x, y) is the distance between the vertices x and y. The set W is called a resolving set for G if distinct vertices of G have distinct representations with respect ...
متن کاملk-Remainder Cordial Graphs
In this paper we generalize the remainder cordial labeling, called $k$-remainder cordial labeling and investigate the $4$-remainder cordial labeling behavior of certain graphs.
متن کاملRandomly planar graphs
A graph G is randomly planar if every planar embedding of every connected subgraph of G can be extended to a planar embedding of G. We classify these graphs.
متن کاملRandomly colouring random graphs
We consider the problem of generating a colouring of the random graph Gn,p uniformly at random using a natural Markov chain algorithm: the Glauber dynamics. We assume that there are β∆ colours available, where ∆ is the maximum degree of the graph, and we wish to determine the least β = β(p) such that the distribution is close to uniform in O(n log n) steps of the chain. This problem has been pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1981
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700006961